Verification of mutual exclusion algorithms with EST
نویسندگان
چکیده
Mutual exclusion algorithms are a simple and popular example of concurrent systems. We report about the verification of some of them with verification package EST. In the paper we propose modified models for Dekker’s and Peterson’s algorithm which give a compound system without divergent states. For Hyman’s algorithm, we explain why it does not preserve mutual exclusion.
منابع مشابه
Verification of a Hierarchical Generic Mutual Exclusion Algorithm
In distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verificati...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Framework for Fault-Tolerant Distributed Mutual Exclusion and Replica Control Using Grid Structures
This paper presents a framework for fault-tolerant distributed mutual exclusion and replica control algorithms utilizing overlapping grid quorums, which are sets constructed with the aid of grid structures. There are two components of the framework: the first one concerns generic representation of grid quorums, and the second one, generic verification of the overlapping properties of grid quoru...
متن کاملModeling and Verification of a Dynamic Information Structure Distributed Mutual Exclusion Algorithm Using Spin
In a distributed system, mutual exclusion is a condition which ensures that a shared resource in the system can be accessed by one and only one process at a time. Mutual exclusion ensures that only one process can be in its critical section at a time. Many distributed mutual exclusion algorithms have been proposed and verified [1][2][3][4][5]. In this paper, we have modeled and verified the dyn...
متن کاملAutomated Analysis of Parametric Timing-Based Mutual Exclusion Algorithms
Deadlock-free algorithms that ensure mutual exclusion crucially depend on timing assumptions. In this paper, we describe our experience in automatically verifying mutual-exclusion and deadlock-freedom of the Fischer and Lynch-Shavit algorithms, using the model checker modulo theories mcmt. First, we explain how to specify timing-based algorithms in the mcmt input language as symbolic transition...
متن کامل